from typing import *


class Solution:

    def findPrimePairs(self, n: int) -> List[List[int]]:
        isPrime = [True] * (n  + 1)
        isPrime[1] = False
        primes = []
        for i in range(2, n):
            if isPrime[i]:
                primes.append(i)
            for p in primes:
                if p * i > n:
                    break
                isPrime[p * i] = False
                if i % p == 0:
                    break
        ans = []
        for i in primes:
            
            if i >= n - i:
                break
            if isPrime[n - i]:
                ans.append([i, n - i])
        return ans


print(11 // 2)